Hyper-Systolic Matrix Multiplication
نویسندگان
چکیده
A novel parallel algorithm for matrix multiplication is presented. The hyper-systolic algorithm makes use of a one-dimensional processor abstraction. The procedure can be implemented on all types of parallel systems. It can handle matrix-vector multiplications as well as transposed matrix products.
منابع مشابه
Generalized Hyper-Systolic Algorithm
We generalize the hyper-systolic algorithm proposed in [1] for abstract data structures on massive parallel computers with np processors. For a problem of size V the communication complexity of the hyper-systolic algorithm is proportional to √ npV , to be compared with npV for the systolic case. The implementation technique is explained in detail and the example of the parallel matrix-matrix mu...
متن کاملHyper-systolic algorithms for N-body computations and parallel level-3 BLAS libraries
Hyper-systolic algorithms repesent a new class of parallel computing structures. Because of their regular communication and compute patterns they are well suited for implementation on most parallel architectures, in particular, high performance SIMD machines can beneet considerably. After a short explanation of the concept of hyper-systolic algorithms, their application to N-body computations a...
متن کاملFilomat 17 (2003), 135–141 Matrix Multiplication on Bidirectional Linear Systolic Arrays
This paper addresses the problem of rectangular matrix multiplication on bidirectional linear systolic arrays (SAs). We analyze all bidirectional linear SAs in terms of efficiency. We conclude that the efficiency depends on the relation between the loop boundaries in the systolic algorithm (i.e. matrix dimensions). We point out which SA is the best choice depending on the relation between matri...
متن کاملReducing the Number of Processors Elements in Systolic Arrays for Matrix Multiplication
Author is discussing a problems of determining parameters suitable systolic arrays for implementation regular 3-nested loop algorithms. Author shows that if the characteristics of so called adaptable algorithms to the projection direction are used we have the best results. This characteristics can be space (number of processor elements,chip area, input-output elements, ...), time(flow period of...
متن کامل2D matrix multiplication on a 3D systolic array
The introduction of systolic arrays in the late 1970s had an enormous impact on the area of special purpose computing. However, most of the work so far has been done with onedimensional and two-dimensional (2D) systolic arrays. Recent advances in three-<limensional VLSI (3D VLSI) and 3D packaging of2D VLSI components, has made the idea of 3D systolic arrays feasible in the near future. In this ...
متن کامل